Nonsmooth Analysis, Convex Analysis, and their Applications to Motion Planning
نویسنده
چکیده
Nonsmooth analysis of a broad class of functions taking the form F (x) = mini fi(x), where each fi is a convex function. One element of this class of functions is the distance function, which measures the distance between a point and the nearest point on the nearest obstacle. Many motion planning algorithms are based on the distance function, and thus rigorous analysis of the distance function can provide a better understanding of how to implement traditional motion planning algorithms. Finally, this paper enumerates some useful results in convex analysis.
منابع مشابه
An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملLong term motion analysis for object level grouping and nonsmooth optimization methods = Langzeitanalyse von Bewegungen zur objektorientierten Gruppierung und nichglatte Optimierungsmethoden
This work deals with theoretical and practical aspects of convex and nonconvex optimization algorithms for several classes of problems. They are applied to several (low-level) computer vision tasks. The optical flow motion estimation problem, which is among them, is a potential source for improving motion based segmentation methods. The second, more practical part of this work focuses on such a...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملSolving generation expansion planning problems with environmental constraints by a bundle method
We discuss the energy generation expansion planning with environmental constraints, formulated as a nonsmooth convex constrained optimization problem. To solve such problems, methods suitable for constrained nonsmooth optimization need to be employed. We describe a recently developed approach, which applies the usual unconstrained bundle techniques to a dynamically changing “improvement functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 9 شماره
صفحات -
تاریخ انتشار 1999